package LeetCode;

public class LC_674_LongestContinuousIncreasingSubsequence {

    public static void main(String[] args) {

    }

    class Solution {
        public int findLengthOfLCIS(int[] nums) {
            int res = 0;
            if (nums == null || nums.length < 1) return res;
            res = 1;
            int count = 1;
            for (int i = 1; i < nums.length; i++) {
                if (nums[i] > nums[i - 1]) count++;
                else {
                    res = Math.max(res, count);
                    count = 1;
                }
            }
            res = Math.max(res, count);
            return res;
        }
    }

}